Rate-Controlled Static-Priority Queueing

نویسندگان

  • Hui Zhang
  • Domenico Ferrari
چکیده

We propose a new service discipline, called the RateControlled Static-Priority (RCSP) queueing discipline, that can provide throughput, delay, delay jitter, and loss free guarantees in a connection-oriented packet-switching network. Previously proposed solutions are based on either a time-framing strategy, or a sorted priority queue mechanism. Time-framing schemes suffer from the dependencies they introduce between the queueing delay and the granularity of bandwidth allocation; sorted priority queues are more complex, and may be difficult to implement. The proposed RCSP queueing discipline avoids both time-framing and sorted priority queues; it achieves flexibility in the allocation of delay and bandwidth, as well as simplicity of implementation. The key idea is to separate rate-control and delay-control functions in the design of the server. Applying this separation of functions will result in a class of service disciplines, of which RCSP is an instance.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

In Proceedings of IEEE INFOCOM ’ 93 Rate - Controlled Static - Priority Queueing

We propose a new service discipline, called the RateControlledStatic-Priority (RCSP) queueing discipline, that can provide throughput, delay, delay jitter, and loss free guarantees in a connection-oriented packet-switching network. Previously proposed solutions are based on either a time-framing strategy, or a sorted priority queue mechanism. Time-framing schemes suffer from the dependencies th...

متن کامل

Analysis of Prioritized Scheduling of Assured Forwarding in DiffServ Architectures

Assured Service has been proposed within the Differentiated Services (DiffServ) model to provide relative service differentiation by attempting to allocate bandwidth to different users in a controlled way during periods of network congestion. In this paper, we analyze the Assured Service scheme by means of a priority queueing system with statedependent service scheduling based on thresholds. We...

متن کامل

Usage of Network-Level Dynamic Priority and Its Comparison with Static Priority

To provide better QoS management, we investigated network-level dynamic priority methods. We propose methods in which packets of the same type of application receive different treatment in the network, depending on the route information. They feature a simple mechanism, which enables the methods to be executed easily with a small processing load at the routers as well as a small amount of infor...

متن کامل

On the value function of a priority queue with an application to a controlled polling model

We give a closed-form expression for the discounted weighted queue length and switching costs of a two-class single-server queueing model under a preemptive priority rule. These expressions are used to do a single step of policy iteration in a polling model with a dynamically controlled switching rule, starting from the preemptive priority rule. Numerical experiments show that this leads to a p...

متن کامل

Proof of Monotone Loss Rate of Fluid Priority-Queue with Finite Buffer

This paper studies a fluid queueing system that has a single server, a single finite buffer, and which applies a strict priority discipline to multiple arriving streams of different classes. The arriving streams are modeled by statistically independent, identically distributed random processes. A proof is presented for the highly intuitive result that, in such a queueing system, a higher priori...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1993